Matching island topologies to problem structure in parallel evolutionary algorithms
نویسندگان
چکیده
منابع مشابه
Parallel Evolutionary Algorithms for Multiobjective Placement Problem
Non-deterministic iterative heuristics such as Tabu Search (TS), Simulated Evolution (SimE), Simulated Annealing (SA), and Genetic Algorithms (GA) are being widely adopted to solve a range of hard optimization problems [1]. This interest is attributed to their generality, ease of implementation, and their ability to deliver high quality results. However, depending on the size of the problem, su...
متن کاملEvolutionary Algorithms, Randomized Local Search, and the Maximum Matching Problem
The design and analysis of problem-specific algorithms for combinatorial optimization problems is a well-studied subject. It is accepted that randomization is a powerful concept for theoretically and practically efficient problem-specific algorithms. Randomized search heuristics like randomized local search, tabu search, simulated annealing, and variants of evolutionary algorithms can be combin...
متن کاملFast Parallel Approximation Algorithms for Maximum Weighted Matching Problem
We present two parallel approximation algorithms for nding a matching of maximum weight in a given edge-weighted graph. To deal with unbounded weights e ciently on a PRAM, the algorithms only use the total order of the weights. That is, we assume that the algorithms can only compare with weights of edges. The rst algorithm deterministically runs in O(log n) time. Its approximation ratio is 2 3 ...
متن کاملParallel Approximation Algorithms for the Weighted Maximum Matching Problem
We consider the problem of computing a matching in a large weighted graph using a parallel algorithm. Since an exact algorithm for the weighted matching problem is fairly costly we instead develop a fast approximation algorithm. The parallel algorithm is based on a distributed algorithm due to Hoepman [6]. Through experiments using both complete as well as sparse graphs we show that our new alg...
متن کاملParallel Algorithms for String Matching Problem Baesd on Butterfly Model
The string matching problem is one of the most studied problems in computer science. While it is very easily stated and many of the simple algorithms perform very well in practice, numerous works have been published on the subject and research is still very active. In this paper we propose a butterfly parallel computing model for parallel string matching. Experimental results show that, on a mu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2013
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-013-0995-9